When Are Description Logic Knowledge Bases Indistinguishable?
نویسندگان
چکیده
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queries is fundamental for many KB engineering and maintenance tasks including versioning, module extraction, knowledge exchange and forgetting. We study the combined and data complexity of this inseparability problem for fragments of Horn-ALCHI, including the description logics underpinning OWL 2 QL and OWL 2 EL.
منابع مشابه
“What’s not in a name?” Initial Explorations of a Structural Approach to Integrating Large Concept Knowledge-Bases
We are interested in providing semi-automatic support for the task of integrating large knowledge bases (KBs) through the use of structural information in description logics. For that reason we set up a formal framework for the integration of KBs which enables us to investigate the potential and limits of using structural information (in contrast to just thesaurus information involving identifi...
متن کاملHorn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data complexity of the instance checking problem is coNP-complete even for Horn knowledge bases in the basic description logic ALC. In this paper, we present and study weakenings with PTime data complexity of the instance checking pr...
متن کاملEpistemic First-order Queries over Description Logic Knowledge Bases
Querying Description Logic knowledge bases has received great attention in the last years. The need of coping with incomplete information is the distinguishing feature with respect to querying databases. Due to this feature, we have to deal with two conflicting needs: on the one hand, we would like to query the knowledge base with sophisticated mechanisms provided by full first-order logic as i...
متن کاملG-Hybrid Knowledge Bases
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web. We define g-hybrid knowledge bases as knowledge bases that consist of a Description Logic knowledge base and a guarded logic program, similarly to the DL+log knowledge bases from [25]. G-hybrid knowledge bases enable an integration of Description Logics and Logic Programming where,...
متن کامل